Study of a P2P overlay network based on binary balance tree 一种基于二叉平衡树的P2P覆盖网络的研究
The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol ( DBTP) was proposed. 研究有度和延时约束的覆盖多播路由问题,提出了一个新的覆盖多播路由协议-延时受限的树协议(DBTP)。
A Dual Loop Map Overlay Algorithm Based on R+ Tree 基于R+树的地图叠加分析双重循环算法
Map Overlay is an important spatial analysis in Geographic Information Systems. This paper presents a novel dual loop algorithm based on R+ tree to process vector map overlay analysis. 地图叠加是非常重要的GIS空间分析功能之一,为此,提出了一种新的基于R+树空间索引的矢量地图叠加分析双重循环算法,首先采用多边形穷举求交方法计算出线段相交点;
A New Algorithm for Minimum Delay Overlay Multicast Tree 一种新的最小延时覆盖多播树算法
Adopted distributed and tree-first strategies, the protocol enabled members of a multicast group to self-organize into a sourced-based overlay multicast tree. 该协议采用分布式和树优先的策略,使多播组成员之间能自组织地构建一棵基于源的覆盖多播树。
SSALM protocol adopted tree-first approach, which constructed source-specific multicast tree among group members and constructed overlay network based on the tree. SSALM协议采用树优先的构造策略,在组成员之间构造基于源的组播分发树,并在源树的基础上建立叠加网。
To support heterogeneous QoS requirements of real-time multimedia multicast applications, a new QoS overlay multicast routing protocol called QoS-aware Overlay Multicast Tree Protocol ( QOMTP) is proposed, and its local optimum algorithm is studied, too. 面向实时多媒体多播应用,提出了一个支持异构QoS需求的分布式、树优先的覆盖多播路由协议&QoS覆盖多播树协议(QOMTP),并研究了其局部优化算法。
In order to solve the NP hard problem of constructing overlay multicast trees, a multicast tree heuristic algorithm, based on the degree constraint of nodes, is proposed. 针对创建Overlay组播树的NP难问题,在节点度约束条件下,研究一个构建组播树的启发式算法。
Through overlay analysis between rules between the main species found mixed relationship, the choice of tree species has certain guiding significance. 通过规则之间的叠加分析发现主要树种之间的混交关系,对造林树种的选择具有一定的指导意义。
Further more, a overlay multicast structure based on access network devices is put forward too. In the structure, setting up a minimum cost multicast tree is solving by a heuristic algorithm ( based on genetic algorithm). 在基于边缘接入设备的overlay组播模型中的最小开销组播树建立问题中使用了一种启发式算法求解(基于遗传算法)。
To meet the IPv6 address protocol, this thesis establishes overlay network structure based on the tree ring networks, and proposes the corresponding resource search algorithm. 为适应IPv6地址协议,基于树环网建立了覆盖网络结构,并给出相应的资源搜索算法。
This solution is based on the random overlay network and non-DHT overlay network topology model, having the node capability-constrained function as well as low maintenance cost of multicast tree and dynamic member management ability. 该方案建立在随机覆盖网和非DHT覆盖网拓扑模型基础上,具有结点能力约束性能,同时多播树维护量小,具有动态成员管理能力。
Aimed at any overlay multicast tree, we proposed a rate allocation algorithm based on receivers under max-min fairness. 主要内容包括:1、针对任意一棵已经存在的Overlay组播树,研究max-min公平性条件下的基于接收端的速率分配算法。
The object of overlay multicast routing includes two aspects: one is to find a spanning tree that has minimum diameter, subject to degree constraint ( MDDBST); the other is to accommodate the maximum number of sessions, with acceptable application performance. 覆盖网络路由的目标包括两方面:其一是寻找带度约束的最小直径组播树MDDBST,其二是以一定的应用层性能尽可能同时满足更多的组播会话请求。
This paper put forward an any-source overlay multicast service solution without the need to establish a visible multicast tree. 本文提出一个任意源覆盖多播服务方案,无须建立显式的多播树。